Multidecompositions of the Balanced Complete Bipartite Graph into Paths and Stars
نویسندگان
چکیده
منابع مشابه
Uniform coverings of 2-paths in the complete graph and the complete bipartite graph
Let G be a graph and H a subgraph of G. A D(G,H, λ) design is a collection D of subgraphs of G each isomorphic to H so that every 2-path (path of length 2) in G lies in exactly λ subgraphs in D. The problem of constructing D(Kn, Cn, 1) designs is the so-called Dudeney’s round table problem. We denote by Ck a cycle on k vertices and by Pk a path on k vertices. In this paper, we construct D(Kn,n,...
متن کاملOn Paths in a Complete Bipartite Geometric Graph
Let A and B be two disjoint sets of points in the plane such that no three points of A ∪ B are collinear, and let n be the number of points in A. A geometric complete bipartite graph K(A, B) is a complete bipartite graph with partite sets A and B which is drawn in the plane such that each edge of K(A, B) is a straight-line segment. We prove that (i) If |B| ≥ (n + 1)(2n − 4) + 1, then the geomet...
متن کاملPartitioning the vertex set of a bipartite graph into complete bipartite subgraphs
Given a graph and a positive integer k, the biclique vertex-partition problem asks whether the vertex set of the graph can be partitioned into at most k bicliques (connected complete bipartite subgraphs). It is known that this problem is NP-complete for bipartite graphs. In this paper we investigate the computational complexity of this problem in special subclasses of bipartite graphs. We prove...
متن کاملOn Subgraphs of the Complete Bipartite Graph
G(n) denotes a graph of n vertices and G(n) denotes its complementary graph. In a complete graph every two distinct vertices are joined by an edge. Let C k (G(n)) denote the number of complete subgraphs of k vertices contained in G(n). Recently it was proved [1] that for every k 2 (n) (1) min C (G (n)) + Ck(G(n)) < k k, , ! 2 2 where the minimum is over all graphs G(n). It seems likely that (1)...
متن کاملBalanced Degree-Magic Labelings of Complete Bipartite Graphs under Binary Operations
A graph is called supermagic if there is a labeling of edges where the edges are labeled with consecutive distinct positive integers such that the sum of the labels of all edges incident with any vertex is constant. A graph G is called degree-magic if there is a labeling of the edges by integers 1, 2, ..., |E(G)| such that the sum of the labels of the edges incident with any vertex v is equal t...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ISRN Combinatorics
سال: 2013
ISSN: 2090-8911
DOI: 10.1155/2013/398473